Introduction

• Division is one of the four basic arithmetic operations, yet it hides a surprisingly deep structure.
• When dividing whole numbers, we often cannot divide “evenly.”
• This leads naturally to the ideas of quotients and remainders.
• The Division Algorithm is a precise mathematical statement describing how division with remainder always works for integers.

What We Mean by Division

• Division answers the question:
  “How many times does one number fit into another?”
• For whole numbers:
  • $a$ is the dividend (the number being divided).
  • $b$ is the divisor (the number we divide by).
• If $b$ divides $a$ exactly, we write $$a = bq$$ where $q$ is the quotient.
• But most of the time, $a$ is not a perfect multiple of $b$.

Quotients and Remainders: An Intuitive Start

• When division is not exact, we record:
  • how many full groups we can make (the quotient), and
  • what is left over (the remainder).
• Example: dividing 17 apples among groups of 5:
  • 5 fits into 17 three times ($3 \times 5 = 15$).
  • 2 apples are left over.
• So we write $$17 = 5\cdot 3 + 2.$$
• This pattern works for any whole numbers $a$ and $b>0$.

The Division Algorithm: Informal Statement

Every number can be broken into full groups of $b$, plus a leftover that is smaller than $b$.

The Division Algorithm: Formal Statement and Meaning

The formal version uses integers:

• For any integers $a$ and $b$ with $b>0$, there exist unique integers $q$ and $r$ such that $$a = bq + r \quad\text{and}\quad 0 \le r < b.$$

Key points:

• $q$ is the quotient.
• $r$ is the remainder.
• The conditions guarantee:
  • $r$ is never negative.
  • $r$ is always smaller than $b$.
• This is not an algorithm in the modern sense (like a step‑by‑step procedure).
  • It is a theorem guaranteeing existence and uniqueness.

Working Through Simple Examples

Example 1: $23$ divided by $4$

• $4$ fits into $23$ five times ($5\cdot 4 = 20$).
• Remainder: $3$.
• So $$23 = 4\cdot 5 + 3.$$

Example 2: $100$ divided by $9$

• $9\cdot 11 = 99$.
• Remainder: $1$.
• So $$100 = 9\cdot 11 + 1.$$

Example 3: $7$ divided by $8$

• $8$ does not fit into $7$ even once.
• Quotient: $0$.
• Remainder: $7$.
• So $$7 = 8\cdot 0 + 7.$$

Uniqueness of Quotient and Remainder

Why are $q$ and $r$ unique?

• Suppose we had two different pairs $(q,r)$ and $(q',r')$ satisfying $$a = bq + r = bq' + r'.$$
• Rearranging gives $$b(q - q') = r' - r.$$
• The left side is a multiple of $b$.
• The right side is a difference of two numbers each between $0$ and $b-1$, so it must lie between $-(b-1)$ and $(b-1)$.
• The only multiple of $b$ in that range is $0$.
• Therefore $r' - r = 0$ and $q - q' = 0$.
• So $q=q'$ and $r=r'$.

Extending the Idea to Negative Integers

When $a$ is negative, we still want the remainder $r$ to satisfy $0 \le r < b$.

Examples:

Example 1: $a=-7$, $b=5$

• We want $$-7 = 5q + r,\quad 0 \le r < 5.$$
• Try $q=-2$: $$5(-2) = -10,\quad r = -7 - (-10) = 3.$$
• Works perfectly: $$-7 = 5(-2) + 3.$$

Example 2: $a=-1$, $b=4$

• Try $q=-1$: $$4(-1) = -4,\quad r = -1 - (-4) = 3.$$
• So $$-1 = 4(-1) + 3.$$

General idea:

• Choose $q$ so that $bq$ is the largest multiple of $b$ not exceeding $a$.
• Then compute $r = a - bq$.

Common Misconceptions and Pitfalls

• Misconception: The remainder can be negative.
  • In this formal setting, the remainder is always non‑negative.
• Misconception: The quotient must be the “usual” one from a calculator.
  • Calculators often give decimal quotients; here we use integer quotients.
• Pitfall: Forgetting that $r < b$.
  • If $r \ge b$, you haven’t divided out enough copies of $b$.
• Pitfall: Thinking the Division Algorithm is a procedure.
  • It is a theorem, not a step‑by‑step algorithm.

Applications in Later Mathematics

The Division Algorithm underlies many important ideas:

• Modular arithmetic
  • The remainder $r$ is exactly $a \bmod b$.
• Greatest common divisors
  • The Euclidean Algorithm repeatedly applies the Division Algorithm.
• Number theory
  • Congruences, divisibility tests, and Diophantine equations rely on it.
• Computer science
  • Hashing, checksums, and addressing often use remainders.
• Abstract algebra
  • Division with remainder appears in polynomial rings as well.

Calculator

Exercises

Try to write each answer in the form $$a = bq + r,\quad 0 \le r < b.$$

1. Write $29$ divided by $6$ in the form $a = bq + r$.

   Solution

   $29$ divided by $6$

   • $6 \cdot 4 = 24$, $6 \cdot 5 = 30 > 29$.
   • So $q = 4$, $r = 5$.
   • $$29 = 6\cdot 4 + 5.$$
2. Compute the quotient and remainder when $52$ is divided by $7$.

   Solution

   $52$ divided by $7$

   • $7 \cdot 7 = 49$, $7 \cdot 8 = 56 > 52$.
   • So $q = 7$, $r = 3$.
   • $$52 = 7\cdot 7 + 3.$$
3. Express $7$ divided by $12$ using the Division Algorithm.

   Solution

   $7$ divided by $12$

   • $12$ does not go into $7$ even once.
   • So $q = 0$, $r = 7$.
   • $$7 = 12\cdot 0 + 7.$$
4. Find $q$ and $r$ such that $-9 = 4q + r$ with $0 \le r < 4$.

   Solution

   Find $q,r$ such that $-9 = 4q + r$, $0 \le r < 4$

   • Try $q = -3$: $4(-3) = -12$.
   • Then $r = -9 - (-12) = 3$.
   • So $q = -3$, $r = 3$, and $$-9 = 4(-3) + 3.$$
5. Find $q$ and $r$ such that $-20 = 6q + r$ with $0 \le r < 6$.

   Solution

   Find $q,r$ such that $-20 = 6q + r$, $0 \le r < 6$

   • Try $q = -4$: $6(-4) = -24$.
   • Then $r = -20 - (-24) = 4$.
   • So $q = -4$, $r = 4$, and $$-20 = 6(-4) + 4.$$
6. True or false: In the Division Algorithm, the remainder may equal the divisor.

   Solution

   True or false: In the Division Algorithm, the remainder may equal the divisor

   • The Division Algorithm requires $0 \le r < b$.
   • So the remainder must be strictly less than the divisor.
   • Answer: False.
7. If $a = 5q + 2$, what is $a$ when $q=13$?

   Solution

   If $a = 5q + 2$ and $q = 13$, find $a$

   • Substitute $q = 13$: $$a = 5\cdot 13 + 2 = 65 + 2 = 67.$$
   • So $a = 67$.
8. Compute the remainder when $103$ is divided by $10$.

   Solution

   Remainder when $103$ is divided by $10$

   • $10 \cdot 10 = 100$, remainder $3$.
   • So $q = 10$, $r = 3$, and $$103 = 10\cdot 10 + 3.$$
9. Find $q$ and $r$ such that $0 = 9q + r$ with $0 \le r < 9$.

   Solution

   Find $q,r$ such that $0 = 9q + r$, $0 \le r < 9$

   • Take $q = 0$: then $r = 0$.
   • Check: $0 = 9\cdot 0 + 0$ and $0 \le 0 < 9$.
   • So $q = 0$, $r = 0$.
10. Explain why the quotient in $a = bq + r$ must be an integer.

    Solution

    Explain why the quotient in $a = bq + r$ must be an integer

    • The Division Algorithm is about writing $a$ as a sum of:
      • an integer multiple of $b$, and
      • a remainder $r$ with $0 \le r < b$.
    • If $q$ were not an integer, $bq$ would not be a whole number, and $a = bq + r$ could not describe how many whole groups of size $b$ fit into $a$.
    • So $q$ must be an integer to keep everything in the world of integers.